Matrix-based Genetic Algorithm Approach on Bicriteria Minimum Spanning Tree Problem with Interval Coefficients
نویسندگان
چکیده
منابع مشابه
The bicriteria minimum spanning tree problem
Let G = (V,E) be an undirected graph with a weight function and a cost function on edges. The bicriteria minimum spanning tree problem is concerned with the determination of a minimum cost spanning tree T in G subject to the constraint that the total weight in T is at most a given bound B. In this paper, we present two polynomial time approximation schemes (PTASs) for the bicriteria minimum spa...
متن کاملGenetic algorithm approach on multi-criteria minimum spanning tree problem
Minimum Spanning Tree (MST) problem is of high importance in network optimization. The multi-criteria MST (mc-MST) is a more realistic representation of the practical problem in the real-world, but it is diicult for the traditional network optimization technique to deal with. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. Without neglecting its network ...
متن کاملMinimum Edge Ranking Spanning Tree Problem on Interval Graphs
The minimum edge ranking spanning tree problem on graph G is to find a spanning tree T of G such that the minimum edge ranking of T is minimum among all possible spanning trees of G. In this paper, we propose a linear-time algorithm for this problem on interval graphs.
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملA tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
This paper deals with the strongly NP-hard minmax regret version of the minimum spanning tree problem with interval costs. The best known exact algorithms solve the problem in reasonable time for rather small graphs. In this paper an algorithm based on the idea of tabu search is constructed. Some properties of the local minima are shown. Exhaustive computational tests for various classes of gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 1998
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.10.6_1144